RMI-DRE: a redundancy-maximizing identification scheme for data redundancy elimination
نویسندگان
چکیده
منابع مشابه
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms which are redundant in the sense that they can be recovered from the types of other subterms. This system is capable of omitting more redundant information than previous work in the same vein, because of its uniform tre...
متن کاملHigher-Order Redundancy Elimination
Functional programs often de ne functions by pat tern matching where patterns may inadvertedly overlap through successive function calls This leads to hidden in e ciencies since the recursively called function possibly repeats redundant tests while trying to match the pat tern An analysis which is based on conservative symbolic execution similar to higher order constant propagation is proposed ...
متن کاملCut-elimination and Redundancy-elimination by Resolution
Cut-elimination is one of the most important techniques in proof theory. Roughly speaking, eliminating cuts from a proof generates a new proof without lemmas, which essentially consists of the syntactic material of the proven theorem. Traditionally cutelimination served the purpose to show consistency of calculi and thus played a central role in metamathematics. In this traditional context the ...
متن کاملRedundancy Elimination with aLexicographic Solved
Detection of redundant linear constraints is important for a variety of applications including linear programming, variable elimination, canonical forms, and convex hull algorithms to name a few. Systematic semantic methods (i.e. optimization) exist to identify all redundant constraints but they are generally computationally expensive. It is thus desirable to identify syntactic criteria to redu...
متن کاملValue-Based Partial Redundancy Elimination
Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) execution paths. Global value numbering (GVN) is a program analysis and transformation that identifies operations that compute the same value and eliminates operations that are redundant. A weakness of PRE is that it traditional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2016
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-016-5523-y